The Utility of Graph Theoretic Software Metrics: a Case Study
نویسندگان
چکیده
The adoption of and adherence to object-oriented design and programming principles have allowed the software industry to create applications of ever-increasing complexity. A concomitant need arises for strategies to identify, manage, and, wherever possible, reduce this software complexity. One such strategy is the systematic collection, interpretation, and analysis of software metrics, mappings from software objects or constructs to sets of numerical features that quantify relevant software attributes. We describe a novel approach that employs various graph theoretic algorithms to analyze the higher level, application-wide class relationship graphs that emerge from object-oriented software. In addition to the software’s overall inheritance tree characteristics, these algorithms will use metrics that reflect information on the import and export coupling of class-attribute and classmethod relationships. Further, we incorporate information relating to the response sets for each object in the software, that is, the number of methods that can be executed in response to messages being received by objects.
منابع مشابه
Exact annihilating-ideal graph of commutative rings
The rings considered in this article are commutative rings with identity $1neq 0$. The aim of this article is to define and study the exact annihilating-ideal graph of commutative rings. We discuss the interplay between the ring-theoretic properties of a ring and graph-theoretic properties of exact annihilating-ideal graph of the ring.
متن کاملA note on a graph related to the comaximal ideal graph of a commutative ring
The rings considered in this article are commutative with identity which admit at least two maximal ideals. This article is inspired by the work done on the comaximal ideal graph of a commutative ring. Let R be a ring. We associate an undirected graph to R denoted by mathcal{G}(R), whose vertex set is the set of all proper ideals I of R such that Inotsubseteq J(R), where J(R) is...
متن کاملSome results on a supergraph of the comaximal ideal graph of a commutative ring
Let R be a commutative ring with identity such that R admits at least two maximal ideals. In this article, we associate a graph with R whose vertex set is the set of all proper ideals I of R such that I is not contained in the Jacobson radical of R and distinct vertices I and J are joined by an edge if and only if I and J are not comparable under the inclusion relation. The aim of this article ...
متن کاملSOME RESULTS ON THE COMPLEMENT OF THE INTERSECTION GRAPH OF SUBGROUPS OF A FINITE GROUP
Let G be a group. Recall that the intersection graph of subgroups of G is an undirected graph whose vertex set is the set of all nontrivial subgroups of G and distinct vertices H,K are joined by an edge in this graph if and only if the intersection of H and K is nontrivial. The aim of this article is to investigate the interplay between the group-theoretic properties of a finite group G and the...
متن کاملEvaluating the Correlation Between Pollination Ecosystem Service and Landscape Pattern metrics (Case Study: Qazvin Province)
Pollination is an ecological service with high economic values related to human and ecological wellbeing. This study aims to evaluate the correlation between landscape complexity and pollination service (bee) in Qazvin province at the landscape scale. Landscape pattern metrics (Number of Patches (NP), Patch Richness (PR), Edge Density (ED), and Shannon Index (H)), as a proxy of landscape comple...
متن کامل